Improved Lower Bounds for Constant GC-Content DNA Codes
نویسندگان
چکیده
منابع مشابه
Bounds for DNA Codes with Constant GC-Content
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least d. We also explicitly construct codes that are larger than the best previously-published c...
متن کاملNew lower bounds for constant weight codes
with M (which is expected). However, as M increases beyond Ahstrart -Some new lower bounds are given for A(n,4, IV), the maximum number of codewords in a binary code of length n, min imum distance 4, and constant weight IV. In a number of cases the results significantly 1.0 improve on the best bounds previously known. h=O 1 .
متن کاملImproved lower bounds for multicovering codes
The m-covering radius of a code is a recent generalization of the covering radius of a code. It is the smallest t such that every m-tuple of vectors is contained in a ball of Hamming radius centered at some codeword. We derive new lower bounds for the size of the smallest code that has a given length and m-covering radius.
متن کاملAsymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show relations between them. A slightly improved version of the so-called linkage construction is presented which is e.g. used to construct constant dimension codes...
متن کاملNew LMRD bounds for constant dimension codes and improved constructions
Let V ∼= Fq be a v-dimensional vector space over the finite field Fq with q elements. By [ V k ] we denote the set of all k-dimensional subspaces in V . Its size is given by the q-binomial coefficient [ v k ]q = ∏k−1 i=0 qv−qi qk−qi for 0 ≤ k ≤ v and 0 otherwise. The set of all subspaces of V forms a metric space associated with the so-called subspace distance dS(U,W ) = dim(U + W ) − dim(U ∩ W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2007.911167